Probabilistic analysis of algorithms - PDFSEARCH.IO - Document Search Engine

Probabilistic analysis of algorithms
Results: 137

#	Item
111	The Computational Complexity of Linear Optics Add to Reading List Source URL: theoryofcomputing.org Language: English - Date: 2013-02-09 04:40:42 Quantum complexity theory Analysis of algorithms Linear algebra Quantum computer PP Time complexity BQP Bounded-error probabilistic polynomial Randomized algorithm Theoretical computer science Computational complexity theory Applied mathematics
112	Radio Network Clustering from Scratch Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer {kuhn,moscitho,wattenhofer}@inf.ethz.ch Department of Computer Science, ETH Zurich, 8092 Zurich, Switzerland Abstract. We propose a Add to Reading List Source URL: distcomp.ethz.ch Language: English - Date: 2004-06-25 07:00:09 Mathematics Analysis of algorithms Probabilistic complexity theory Randomized algorithm Dominator Rope Applied mathematics Theoretical computer science Graph theory Binary trees
113	Efficient Adaptive Collect using Randomization Hagit Attiya1 , Fabian Kuhn2 , Mirjam Wattenhofer2 , and Roger Wattenhofer2 1 2 Department of Computer Science, Technion Add to Reading List Source URL: distcomp.ethz.ch Language: English - Date: 2004-08-13 15:01:47 Computational complexity theory Probabilistic complexity theory Randomized algorithm Algorithm SL Immerman–Szelepcsényi theorem In-place algorithm Theoretical computer science Applied mathematics Analysis of algorithms
114	Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs Fabian Kuhn1 , Thomas Moscibroda1 , Tim Nieberg2? , and Roger Wattenhofer1 1 Add to Reading List Source URL: distcomp.ethz.ch Language: English - Date: 2005-07-24 07:43:23 NP-complete problems Analysis of algorithms Probabilistic complexity theory Randomized algorithm Connectivity Topology Unit disk graph Graph coloring Breadth-first search Graph theory Theoretical computer science Mathematics
115	A Scalable and Nearly Uniform Generator of SAT Witnesses? Supratik Chakraborty1 , Kuldeep S. Meel2 , and Moshe Y. Vardi2 1 arXiv:1304.1584v1 [cs.LO] 4 Apr 2013 Add to Reading List Source URL: arxiv.org Language: English - Date: 2013-04-07 20:21:28 Search algorithms Cryptographic hash functions Analysis of algorithms Probabilistic complexity theory Randomized algorithm Algorithm PP Hash function Universal hashing Theoretical computer science Applied mathematics Computational complexity theory
116	Theoretical Justification of Popular Link Prediction Heuristics Purnamrita Sarkar Carnegie Mellon University Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2011-04-16 14:31:09 Network theory Analysis of algorithms Probabilistic complexity theory Randomized algorithm Shortest path problem Graph theory Networks Theoretical computer science Mathematics Computational complexity theory
117	Tight Bounds for Distributed Selection Fabian Kuhn Institute of Theoretical Computer Science ETH Zurich, Switzerland Add to Reading List Source URL: distcomp.ethz.ch Language: English - Date: 2007-04-02 04:50:42 Analysis of algorithms Probabilistic complexity theory Randomized algorithm Selection algorithm B-tree Breadth-first search Time complexity Self-organizing list Tango tree Theoretical computer science Computational complexity theory Applied mathematics
118	How to Generate and Exchange Secrets (extended abstract) Add to Reading List Source URL: www.csee.wvu.edu Language: English - Date: 2009-04-08 11:29:01 Complexity classes Probabilistic complexity theory Analysis of algorithms PP Quantum complexity theory Bounded-error probabilistic polynomial Randomized algorithm IP NP Theoretical computer science Computational complexity theory Applied mathematics
119	Noncryptographic Selection Protocols (Extended Abstract) Uriel Feige Add to Reading List Source URL: www.disco.ethz.ch Language: English - Date: 2011-01-19 07:00:55 Analysis of algorithms Probabilistic complexity theory Randomized algorithm IP Random walk Markov chain Quantum Byzantine agreement Statistics Theoretical computer science Probability theory
120	ICM 2002 • Vol. I • 245^272 Mathematical Foundations of Add to Reading List Source URL: www.mathunion.org Language: English - Date: 2012-04-18 10:56:38 Complexity classes Pseudorandomness Analysis of algorithms Probabilistic complexity theory One-way function Hard-core predicate NP P versus NP problem Time complexity Theoretical computer science Computational complexity theory Applied mathematics

UPDATE